Organizing conceptual graphs for fast knowledge retrieval

نویسنده

  • Iadh Ounis
چکیده

The expressiveness of conceptual graphs allows for accurate representation of knowledge in the domain of information retrieval. However, the complexity of the operators introduced by this formalism are in contradiction with the necessary speed of a practicable information retrieval system. In particular, the projection operator is considered to be time-consuming. We propose a new logic-based organization of conceptual graphs. Considering conceptual graphs from a logical point of view leads to a form of conceptual graphs that we call standard logical form. In this case, the complexity of our retrieval algorithm is polynomial. Retrieval exploits the logic-based organization, and the iterative application of the projection operator in each graph of the collection is changed by a single application of an algorithm to the whole collection. The algorithm is presented in detail and its complexity is studied. Experimentations on a collection of 650 images, by using an already existent conceptual graphs platform, show net improvement in retrieval time performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-Organizing Retrieval System for Graphs

The design of a general knowledge base for labeled graphs is presented. The design involves a partial ordering of graphs represented as subsets of nodes of a universal graph. The knowledge base’s capabilities of fast retrieval and self-organization are a result of its ability to recognize common patterns among its data items. The system is being used to support a knowledge base in Organic Chemi...

متن کامل

Labeling Update of Segmented Images using Conceptual Graphs and Dempster-Shafer Theory of Evidence

The extraction of objects present in photographs is a major problem to tackle when considering photographs retrieval. Such objects (or people) have to be detected in a way to allow retrieval based on concepts and not on physical characteristics like colors or textures. In a way to achieve a reasonable detection rate, in context image analysis has to be used. We propose here to use conceptual gr...

متن کامل

Exploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval

The graph structure of a conceptual graph can be used for eecient retrieval in complex (graphical) object databases. The aim is to replace most graph matching with eecient operations on precompiled codes for graphs. The unlabeled graph or \skeleton" of a type-labeled conceptual graph (without negated contexts) can be used as a lter for matching, subsumption testing, and uniication. For two type...

متن کامل

Extending a Logic-Based Retrieval Model With Algebraic Knowledge

A major need of precision-oriented retrieval systems is the availability of high-level indexing languages which can allow the representation and the manipulation of elaborated concepts for both indexing and querying processes. Such elaborated knowledge representations, as the one developed in the RIME project, need in turn to be fully integrated within the underlying retrieval model to ensure p...

متن کامل

Effective and Efficient Relational Query Processing Using Conceptual Graphs

In a recent paper (see Ounis & Huibers’s work), a logical relational framework for information retrieval is presented, which emphasizes the importance of relations for accurate indexing, as well as the need to provide relation treatments for effective retrieval. Most knowledge representation formalisms support relational indexing. However, the majority of them do not fully allow relation treatm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998